Almost Splitting Sets and Agcd Domains

نویسندگان

  • D. D. ANDERSON
  • TIBERIU DUMITRESCU
چکیده

Let D be an integral domain. A multiplicative set S of D is an almost splitting set if for each 0 6= d ∈ D, there exists an n = n(d) with dn = st where s ∈ S and t is v-coprime to each element of S. An integral domain D is an almost GCD (AGCD) domain if for every x, y ∈ D, there exists a positive integer n = n(x, y) such that xnD ∩ ynD is a principal ideal. We prove that the polynomial ring D[X ] is an AGCD domain if and only if D is an AGCD domain and D[X ] ⊆ D0[X] is a root extension, where D0 is the integral closure of D. We also show that D + XDS [X ] is an AGCD domain if and only if D and DS [X] are AGCD domains and S is an almost splitting set.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Locally GCD domains and the ring $D+XD_S[X]$

An integral domain $D$ is called a emph{locally GCD domain} if $D_{M}$ is aGCD domain for every maximal ideal $M$ of $D$. We study somering-theoretic properties of locally GCD domains. E.g., we show that $%D$ is a locally GCD domain if and only if $aDcap bD$ is locally principalfor all $0neq a,bin D$, and flat overrings of a locally GCD domain arelocally GCD. We also show that the t-class group...

متن کامل

Fully Homomorphic Encryption over the Integers Revisited

Two main computational problems serve as security foundations of current fully homomorphic encryption schemes: Regev’s Learning With Errors problem (LWE) and HowgraveGraham’s Approximate Greatest Common Divisor problem (AGCD). Our first contribution is a reduction from LWE to AGCD. As a second contribution, we describe a new AGCD-based fully homomorphic encryption scheme, which outperforms all ...

متن کامل

Fully Homomophic Encryption over the Integers Revisited

Two main computational problems serve as security foundations of current fully homomorphic encryption schemes: Regev’s Learning With Errors problem (LWE) and HowgraveGraham’s Approximate Greatest Common Divisor problem (AGCD). Our first contribution is a reduction from LWE to AGCD. As a second contribution, we describe a new AGCD-based fully homomorphic encryption scheme, which outperforms all ...

متن کامل

A duality between fuzzy domains and strongly completely distributive $L$-ordered sets

The aim of this paper is to establish a fuzzy version of the dualitybetween domains and completely distributive lattices. All values aretaken in a fixed frame $L$. A definition of (strongly) completelydistributive $L$-ordered sets is introduced. The main result inthis paper is that the category of fuzzy domains is dually equivalentto the category of strongly completely distributive $L$-ordereds...

متن کامل

LK-INTERIOR SYSTEMS AS SYSTEMS OF “ALMOST OPEN” L-SETS

We study interior operators and interior structures in a fuzzy setting.We investigate systems of “almost open” fuzzy sets and the relationshipsto fuzzy interior operators and fuzzy interior systems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005